Randomized Signature Sort: Implementation and Performance Analysis
نویسندگان
چکیده
منابع مشابه
Performance Analysis of Merge Sort and Quick Sort: MQSORT
Sorting is considered as a fundamental operation in computer science as it is used as an intermediate step in many operations. Sorting refers to the operation of arranging data in some given order such as increasing or decreasing, with numerical data, or alphabetically, with character data. An algorithm is any well-defined procedure or set of instructions, that takes some input in the form of s...
متن کاملImplementation and Performance Analysis of Elliptic Curve Digital Signature Algorithm
In this paper we present a novel method for obtaining fast software implementation of the Elliptic Curve Digital Signature Algorithm in the finite field GF(p) with an arbitrary prime modulus p of arbitrary length. The most important feature of the method is that it avoids bit-level operations which are slow on microprocessors and performs word-level operations which are significantly faster. Th...
متن کاملDecision Sort and its Parallel Implementation
In this paper, a sorting technique is presented that takes as input a data set whose primary key domain is known to the sorting algorithm, and works with an time efficiency of O(n+k), where k is the primary key domain. It is shown that the algorithm has applicability over a wide range of data sets. Later, a parallel formulation of the same is proposed and its effectiveness is argued. Though thi...
متن کاملPerformance / Price Sort
NTsort is an external sort on WindowsNT 5.0. It has minimal functionality but excellent price performance. In particular, running on mail-order hardware it can sort 1.5 GB for a penny. NT5.0 is not yet available. For commercially available sorts, Postman Sort from Robert Ramey Software Development has elapsed time performance comparable to NTsort, while using less processor time. It can sort 1....
متن کاملB-Flashsort: A High-performance Sort for the MasPar MP-1 and MP-2 Implementation Description
The sorting of large data sets is a key step in a great variety of applications such as query processing, polygon rendering, statistical analysis and optimization problems. While efficient sorting techniques and implementations have long been available for sequential computers, the problem remains a challenge for parallel computers. One reason is that efficient sequential algorithms take into a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2011
ISSN: 0975-8887
DOI: 10.5120/2895-3787